The Alternating Sign Matrix Polytope
نویسنده
چکیده
The Birkhoff (permutation) polytope, Bn, consists of the n × n nonnegative doubly stochastic matrices, has dimension (n− 1)2, and has n2 facets. A new analogue, the alternating sign matrix polytope, ASMn, is introduced and characterized. Its vertices are the Qn−1 j=0 (3j+1)! (n+j)! n × n alternating sign matrices. It has dimension (n− 1)2, has 4[(n− 2)2 +1] facets, and has a simple inequality description. Its face lattice and projection to the permutohedron are also described. Résumé. Le polytope Bn de permutation (aussi dit de Birkhoff) consiste en les matrices double stochastiques n × n non négatives. Il est de dimension (n − 1)2, et a n2 facettes. Un nouvel analogue, le polytope des matrices à signe alternant, ASMn, est présenté et caractérisé. Ses sommets sont les Qn−1 j=0 (3j+1)! (n+j)! matrices n×n à signe alternant. Il est de dimension (n− 1)2, a 4[(n− 2)2 +1] facettes, et est décrit par une inégalité simple. Le treillis de ses faces et sa projection sur le permutoèdre sont également décrits. 1. Background and Summary The Birkhoff (permutation) polytope Bn is defined as the convex hull of n-by-n permutation matrices. Its dimension is (n− 1), it has n! vertices, and has n facets (each facet is made up of all doubly stochastic matrices with a 0 in a specified entry) [9]. Many analogous polytopes have been studied which are subsets of Bn. In contrast, the alternating sign matrix polytope ASMn is formed by taking the convex hull of n-by-n alternating sign matrices, which is a set of matrices containing the permutations. Thus Bn is contained in ASMn. Definition 1.1. Alternating sign matrices (ASMs) are square matrices with the following properties [7]: • entries ∈ {0, 1,−1} • the entries in each row and column sum to 1 • nonzero entries in each row and column alternate in sign Permutation matrices, then, are the alternating sign matrices whose entries are nonnegative. The connection between these two sets of matrices, though, is much deeper. There exists a partial ordering on alternating sign matrices that is a distributive lattice. This lattice contains as a subposet the Bruhat order on the symmetric group, and in fact, it is the smallest lattice that does so (i.e. it is the MacNeille completion of the Bruhat order) [5]. Given this close relationship between permutations and ASMs it is natural to hope for something relating their polytopes. The dimension of ASMn is (n − 1) because the last entry in each row and column must be precisely what is needed to make that row or column sum equal 1. ASMn has 4[(n− 2) + 1] facets and its vertices are the alternating sign matrices (proofs in section 3), whose count is given by [4]:
منابع مشابه
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or column are nonnegative. Such matrices correspond to configurations of spin r/2 statistical mechanical vertex models with domain-wall boundary conditions. The c...
متن کاملAlternating Sign Matrices and Polynomiography
To each permutation matrix we associate a complex permutation polynomial with roots at lattice points corresponding to the position of the ones. More generally, to an alternating sign matrix (ASM) we associate a complex alternating sign polynomial. On the one hand visualization of these polynomials through polynomiography, in a combinatorial fashion, provides for a rich source of algorithmic ar...
متن کاملSymmetric alternating sign matrices
In this note we consider completions of n×n symmetric (0,−1)-matrices to symmetric alternating sign matrices by replacing certain 0s with +1s. In particular, we prove that any n×n symmetric (0,−1)-matrix that can be completed to an alternating sign matrix by replacing some 0s with +1s can be completed to a symmetric alternating sign matrix. Similarly, any n × n symmetric (0,+1)-matrix that can ...
متن کاملFibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas that are combinations of Fibonacci numbers. These results are applied to determine, among other things, the number of vertices of any face of the polytope of tridiagonal doubly stochastic matrices.
متن کاملAffine Alternating Sign Matrices
An Alternating sign matrix is a square matrix of 0’s, 1’s, and −1’s in which the sum of the entries in each row or column is 1 and the signs of the nonzero entries in each row or column alternate. This paper attempts to define an analogue to alternating sign matrices which is infinite and periodic. After showing the analogue we define shares desirable cahracteristics with alternating sign matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009